Sign Change Fault Attacks on Elliptic Curve Cryptosystems
نویسندگان
چکیده
We present a new type of fault attacks on elliptic curve scalar multiplications: Sign Change Attacks. These attacks exploit different number representations as they are often employed in modern cryptographic applications. Previously, fault attacks on elliptic curves aimed to force a device to output points which are on a cryptographically weak curve. Such attacks can easily be defended against. Our attack produces points which do not leave the curve and are not easily detected. The paper also presents a revised scalar multiplication algorithm that provably protects against Sign
منابع مشابه
Algorithm-level Error Detection for ECSM
For some applications, elliptic curve cryptography (ECC) is an attractive choice because it achieves the same level of security with a much smaller key size in comparison with other schemes such as those that are based on integer factorization or discrete logarithm. Unfortunately, cryptosystems including those based on elliptic curves have been subject to attacks. For example, fault-based attac...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملDifferential Fault Attacks on Elliptic Curve Cryptosystems
In this paper we extend the ideas for differential fault attacks on the RSA cryptosystem (see [4]) to schemes using elliptic curves. We present three different types of attacks that can be used to derive information about the secret key if bit errors can be inserted into the elliptic curve computations in a tamper-proof device. The effectiveness of the attacks was proven in a software simulatio...
متن کاملImplementation of Fault Attacks on Elliptic Curve Cryptosystems
The main motivation behind Elliptic Curve Cryptography is to find a Public Key Family which provides the same level of security as Discrete Log Systems or RSA but with shorter operands. Through Fault Attacks, the adversary disturbs the computation of Cryptographic device to obtain information about Secret Key. This paper uses Elliptic Curve Point Multiplication Algorithm based on a binary seque...
متن کامل